منابع مشابه
Pattern Graph Rewrite Systems
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the po...
متن کاملComplete Strategies for Term Graph Narrowing
Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are often implemented on graph-like data structures to exploit sharing of common subexpressions. In this paper, we study the completeness of narrowing in graph-based implementations. We show that the well-known condition for the comple...
متن کاملNon-connuent Term-rewrite Systems
The transfer component of a machine translation (MT) system typically comprises three aspects, namely the transfer structure used to transfer source into target structures, the (set of) transfer rules and the transfer process, which interpretes the set of transfer rules to derive the target from the source structure. The transfer structure can be formally considered as a term and the set of tra...
متن کاملGraph Rewrite Systems for Software Design Transformations
Middleware has become an important part in business applications. Different middleware platforms require different software designs. Even version changes of the used platform often lead to complex re-designs of software. Furthermore, complex business and platform-specific knowledge is required, to translate abstract business models to platform specific implementations. This paper presents the s...
متن کاملGraph Rewrite Rules with Structural Recursion
Graph rewrite rules, programmed by sequencing and iteration, suffice to define the computable functions on graphs—in theory. In practice however, the control program may become hard to formulate, hard to understand, and even harder to verify. Therefore, we have extended graph rewrite rules by variables that are instantiated by a kind of hyperedge replacement, before the so instantiated rules ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.03.056